Higher Rank Graph C∗-algebras
نویسندگان
چکیده
Building on recent work of Robertson and Steger, we associate a C∗–algebra to a combinatorial object which may be thought of as a higher rank graph. This C∗–algebra is shown to be isomorphic to that of the associated path groupoid. Various results in this paper give sufficient conditions on the higher rank graph for the associated C∗–algebra to be: simple, purely infinite and AF. Results concerning the structure of crossed products by certain natural actions of discrete groups are obtained; a technique for constructing rank 2 graphs from “commuting” rank 1 graphs is given.
منابع مشابه
The H Algebras of Higher Rank Graphs
We begin the study of a new class of operator algebras that arise from higher rank graphs. Every higher rank graph generates a Fock space Hilbert space and creation operators which are partial isometries acting on the space. We call the weak operator topology closed algebra generated by these operators a higher rank semigroupoid algebra. A number of examples are discussed in detail, including t...
متن کاملSemigroupoid C*-algebras
A semigroupoid is a set equipped with a partially defined associative operation. Given a semigroupoid Λ we construct a C*-algebra O(Λ) from it. We then present two main examples of semigroupoids, namely the Markov semigroupoid associated to an infinite 0–1 matrix, and the semigroupoid associated to a higher-rank graph. In both cases the semigroupoid C*-algebra is shown to be isomorphic to the a...
متن کاملProduct Systems of Graphs and the Toeplitz Algebras of Higher-rank Graphs
Abstract. There has recently been much interest in the C∗-algebras of directed graphs. Here we consider product systems E of directed graphs over semigroups and associated C∗-algebras C∗(E) and T C∗(E) which generalise the higher-rank graph algebras of Kumjian-Pask and their Toeplitz analogues. We study these algebras by constructing from E a product system X(E) of Hilbert bimodules, and applyi...
متن کاملSimplicity of C-algebras Associated to Row-finite Locally Convex Higher-rank Graphs
In previous work, the authors showed that the C∗-algebra C∗(Λ) of a rowfinite higher-rank graph Λ with no sources is simple if and only if Λ is both cofinal and aperiodic. In this paper, we generalise this result to row-finite higher-rank graphs which are locally convex (but may contain sources). Our main tool is Farthing’s “removing sources” construction which embeds a row-finite locally conve...
متن کاملClassifying higher rank analytic Toeplitz algebras
To a higher rank directed graph (Λ, d), in the sense of Kumjian and Pask, 2000, one can associate natural noncommutative analytic Toeplitz algebras, both weakly closed and norm closed. We introduce methods for the classification of these algebras in the case of single vertex graphs.
متن کاملMultiply generated dynamical systems and the duality of higher rank graph algebras
We define a semidirect product groupoid of a system of partially defined local homeomorphisms T = (T1, . . . , Tr). We prove that this construction gives rise to amenable groupoids. The associated algebra is a Cuntz-like algebra. We use this construction for higher rank graph algebras in order to give a topological interpretation for the duality in E-theory between C∗(Λ) and C∗(Λop). Introducti...
متن کامل